Data Structure for a Time-Based Bandwidth Reservations Problem
نویسندگان
چکیده
We discuss a problem of handling resource reservations. The resource can be reserved for some time, it can be freed or it can be queried what is the largest amount of reserved resource during a time interval. We show that the problem has a lower bound of Ω(log n) per operation on average and we give a matching upper bound algorithm. Our solution also solves a dynamic version of the related problems of a prefix sum and a partial sum.
منابع مشابه
Design and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints
Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...
متن کاملAn Efficient Data Structure for Advance Bandwidth Reservations on the Internet
In this contribution we present a problem of resource reservation during some time. We show that the problem has a lower bound of per operation on average and also give a matching upper bound algorithm.
متن کاملData Structures for Bandwidth Reservations and Quality of Service on the Internet
This thesis deals firstly with ways to solve the problem of limited resource reservations over time, and secondly, handling conforming traffic in routers. At first glance these topics seem a bit unrelated, but they are both related to the bandwidth brokers introduced by Schelén et. al. for providing quality of service (QoS) and are cases of Algorithm Engineering applied in the field of Computer...
متن کاملElastic reservations for efficient bandwidth utilization in LambdaGrids
We introduce the concept of elastic reservation of bandwidth capacity to mitigate the problem of bandwidth fragmentation in LambdaGrids and present a network model which can support elastic reservations. We also define the Elastic Scheduling Problem (ESP), which succinctly captures the optimal utilization objective of elastic reservations. Analysis of ESP reveals that it is an NP-complete probl...
متن کاملMinimum Bandwidth Reservations for Periodic Streams in Wireless Real-Time Systems
Reservation-based (as opposed to contention-based) channel access in WLANs provides predictable and deterministic transmission and is therefore able to provide timeliness guarantees for wireless and embedded real-time applications. Also, reservation-based channel access is energy-efficient since a wireless adaptor is powered on only during its exclusive channel access times. While scheduling fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.DS/0302009 شماره
صفحات -
تاریخ انتشار 2003